The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

fstsplit(0, x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0, x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0, m) → true
leq(s(n), 0) → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
fstsplit, sndsplit, leq, length, app, map_f, process

They will be analysed ascendingly in the following order:
fstsplit < process
sndsplit < process
leq < process
length < process
app < map_f
app < process
map_f < process

(6) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

The following defined symbols remain to be analysed:
fstsplit, sndsplit, leq, length, app, map_f, process

They will be analysed ascendingly in the following order:
fstsplit < process
sndsplit < process
leq < process
length < process
app < map_f
app < process
map_f < process

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

Induction Base:
fstsplit(gen_0':s8_0(0), gen_nil:cons:f7_0(0)) →_R^Ω(1)
nil

Induction Step:
fstsplit(gen_0':s8_0(+(n10_0, 1)), gen_nil:cons:f7_0(+(n10_0, 1))) →_R^Ω(1)
cons(hole_a3_0, fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0))) →_IH
cons(hole_a3_0, gen_nil:cons:f7_0(c11_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

The following defined symbols remain to be analysed:
sndsplit, leq, length, app, map_f, process

They will be analysed ascendingly in the following order:
sndsplit < process
leq < process
length < process
app < map_f
app < process
map_f < process

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)

Induction Base:
sndsplit(gen_0':s8_0(0), gen_nil:cons:f7_0(0)) →_R^Ω(1)
gen_nil:cons:f7_0(0)

Induction Step:
sndsplit(gen_0':s8_0(+(n619_0, 1)), gen_nil:cons:f7_0(+(n619_0, 1))) →_R^Ω(1)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) →_IH
gen_nil:cons:f7_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

The following defined symbols remain to be analysed:
leq, length, app, map_f, process

They will be analysed ascendingly in the following order:
leq < process
length < process
app < map_f
app < process
map_f < process

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)

Induction Base:
leq(gen_0':s8_0(0), gen_0':s8_0(0)) →_R^Ω(1)
true

Induction Step:
leq(gen_0':s8_0(+(n1296_0, 1)), gen_0':s8_0(+(n1296_0, 1))) →_R^Ω(1)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) →_IH
true

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(14) Complex Obligation (BEST)

(15) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

The following defined symbols remain to be analysed:
length, app, map_f, process

They will be analysed ascendingly in the following order:
length < process
app < map_f
app < process
map_f < process

(16) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
length(gen_nil:cons:f7_0(n1667_0)) → gen_0':s8_0(n1667_0), rt ∈ Ω(1 + n1667₀)

Induction Base:
length(gen_nil:cons:f7_0(0)) →_R^Ω(1)
0'

Induction Step:
length(gen_nil:cons:f7_0(+(n1667_0, 1))) →_R^Ω(1)
s(length(gen_nil:cons:f7_0(n1667_0))) →_IH
s(gen_0':s8_0(c1668_0))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(17) Complex Obligation (BEST)

(18) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)
length(gen_nil:cons:f7_0(n1667_0)) → gen_0':s8_0(n1667_0), rt ∈ Ω(1 + n1667₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

The following defined symbols remain to be analysed:
app, map_f, process

They will be analysed ascendingly in the following order:
app < map_f
app < process
map_f < process

(19) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
app(gen_nil:cons:f7_0(n2005_0), gen_nil:cons:f7_0(b)) → gen_nil:cons:f7_0(+(n2005_0, b)), rt ∈ Ω(1 + n2005₀)

Induction Base:
app(gen_nil:cons:f7_0(0), gen_nil:cons:f7_0(b)) →_R^Ω(1)
gen_nil:cons:f7_0(b)

Induction Step:
app(gen_nil:cons:f7_0(+(n2005_0, 1)), gen_nil:cons:f7_0(b)) →_R^Ω(1)
cons(hole_a3_0, app(gen_nil:cons:f7_0(n2005_0), gen_nil:cons:f7_0(b))) →_IH
cons(hole_a3_0, gen_nil:cons:f7_0(+(b, c2006_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(20) Complex Obligation (BEST)

(21) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)
length(gen_nil:cons:f7_0(n1667_0)) → gen_0':s8_0(n1667_0), rt ∈ Ω(1 + n1667₀)
app(gen_nil:cons:f7_0(n2005_0), gen_nil:cons:f7_0(b)) → gen_nil:cons:f7_0(+(n2005_0, b)), rt ∈ Ω(1 + n2005₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

The following defined symbols remain to be analysed:
map_f, process

They will be analysed ascendingly in the following order:
map_f < process

(22) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol map_f.

(23) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)
length(gen_nil:cons:f7_0(n1667_0)) → gen_0':s8_0(n1667_0), rt ∈ Ω(1 + n1667₀)
app(gen_nil:cons:f7_0(n2005_0), gen_nil:cons:f7_0(b)) → gen_nil:cons:f7_0(+(n2005_0, b)), rt ∈ Ω(1 + n2005₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

The following defined symbols remain to be analysed:
process

(24) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol process.

(25) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)
length(gen_nil:cons:f7_0(n1667_0)) → gen_0':s8_0(n1667_0), rt ∈ Ω(1 + n1667₀)
app(gen_nil:cons:f7_0(n2005_0), gen_nil:cons:f7_0(b)) → gen_nil:cons:f7_0(+(n2005_0, b)), rt ∈ Ω(1 + n2005₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

No more defined symbols left to analyse.

(26) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

(27) BOUNDS(n^1, INF)

(28) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)
length(gen_nil:cons:f7_0(n1667_0)) → gen_0':s8_0(n1667_0), rt ∈ Ω(1 + n1667₀)
app(gen_nil:cons:f7_0(n2005_0), gen_nil:cons:f7_0(b)) → gen_nil:cons:f7_0(+(n2005_0, b)), rt ∈ Ω(1 + n2005₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

No more defined symbols left to analyse.

(29) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

(30) BOUNDS(n^1, INF)

(31) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)
length(gen_nil:cons:f7_0(n1667_0)) → gen_0':s8_0(n1667_0), rt ∈ Ω(1 + n1667₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

No more defined symbols left to analyse.

(32) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

(33) BOUNDS(n^1, INF)

(34) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)
leq(gen_0':s8_0(n1296_0), gen_0':s8_0(n1296_0)) → true, rt ∈ Ω(1 + n1296₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

No more defined symbols left to analyse.

(35) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

(36) BOUNDS(n^1, INF)

(37) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)
sndsplit(gen_0':s8_0(n619_0), gen_nil:cons:f7_0(n619_0)) → gen_nil:cons:f7_0(0), rt ∈ Ω(1 + n619₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

No more defined symbols left to analyse.

(38) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

(39) BOUNDS(n^1, INF)

(40) Obligation:

Innermost TRS:
Rules:
fstsplit(0', x) → nil
fstsplit(s(n), nil) → nil
fstsplit(s(n), cons(h, t)) → cons(h, fstsplit(n, t))
sndsplit(0', x) → x
sndsplit(s(n), nil) → nil
sndsplit(s(n), cons(h, t)) → sndsplit(n, t)
empty(nil) → true
empty(cons(h, t)) → false
leq(0', m) → true
leq(s(n), 0') → false
leq(s(n), s(m)) → leq(n, m)
length(nil) → 0'
length(cons(h, t)) → s(length(t))
app(nil, x) → x
app(cons(h, t), x) → cons(h, app(t, x))
map_f(pid, nil) → nil
map_f(pid, cons(h, t)) → app(f(pid, h), map_f(pid, t))
process(store, m) → if1(store, m, leq(m, length(store)))
if1(store, m, true) → if2(store, m, empty(fstsplit(m, store)))
if1(store, m, false) → if3(store, m, empty(fstsplit(m, app(map_f(self, nil), store))))
if2(store, m, false) → process(app(map_f(self, nil), sndsplit(m, store)), m)
if3(store, m, false) → process(sndsplit(m, app(map_f(self, nil), store)), m)

Types:
fstsplit :: 0':s → nil:cons:f → nil:cons:f
0' :: 0':s
nil :: nil:cons:f
s :: 0':s → 0':s
cons :: a → nil:cons:f → nil:cons:f
sndsplit :: 0':s → nil:cons:f → nil:cons:f
empty :: nil:cons:f → true:false
true :: true:false
false :: true:false
leq :: 0':s → 0':s → true:false
length :: nil:cons:f → 0':s
app :: nil:cons:f → nil:cons:f → nil:cons:f
map_f :: self → nil:cons:f → nil:cons:f
f :: self → a → nil:cons:f
process :: nil:cons:f → 0':s → process:if1:if2:if3
if1 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if2 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
if3 :: nil:cons:f → 0':s → true:false → process:if1:if2:if3
self :: self
hole_nil:cons:f1_0 :: nil:cons:f
hole_0':s2_0 :: 0':s
hole_a3_0 :: a
hole_true:false4_0 :: true:false
hole_self5_0 :: self
hole_process:if1:if2:if36_0 :: process:if1:if2:if3
gen_nil:cons:f7_0 :: Nat → nil:cons:f
gen_0':s8_0 :: Nat → 0':s

Lemmas:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

Generator Equations:
gen_nil:cons:f7_0(0) ⇔ nil
gen_nil:cons:f7_0(+(x, 1)) ⇔ cons(hole_a3_0, gen_nil:cons:f7_0(x))
gen_0':s8_0(0) ⇔ 0'
gen_0':s8_0(+(x, 1)) ⇔ s(gen_0':s8_0(x))

No more defined symbols left to analyse.

(41) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
fstsplit(gen_0':s8_0(n10_0), gen_nil:cons:f7_0(n10_0)) → gen_nil:cons:f7_0(n10_0), rt ∈ Ω(1 + n10₀)

(42) BOUNDS(n^1, INF)